Ideal Lattices and NTRU
نویسندگان
چکیده
منابع مشابه
ILTRU: An NTRU-Like Public Key Cryptosystem Over Ideal Lattices
In this paper we present a new NTRU-Like public key cryptosystem with security provably based on the worst case hardness of the approximate both Shortest Vector Problem (SVP) and Closest Vector Problem (CVP) in some structured lattices, called ideal lattices. We show how to modify the ETRU cryptosystem, an NTRU-Like public key cryptosystem based on the Eisenstein integers 3 [ ] where 3 is a...
متن کاملEfficient (Ideal) Lattice Sieving Using Cross-Polytope LSH
Combining the efficient cross-polytope locality-sensitive hash family of Terasawa and Tanaka with the heuristic lattice sieve algorithm of Micciancio and Voulgaris, we show how to obtain heuristic and practical speedups for solving the shortest vector problem (SVP) on both arbitrary and ideal lattices. In both cases, the asymptotic time complexity for solving SVP in dimension n is 2. For any la...
متن کاملDeterministic and Non-deterministic Basis Reduction Techniques for Ntru Lattices
Author: Daniel Socek Title: Deterministic and Non-Deterministic Basis Reduction Techniques for NTRU Lattices Institution: Florida Atlantic University Thesis Advisor: Dr. Spyros S. Magliveras Degree: Master of Science Year: 2002 Finding the shortest or a “short enough” vector in an integral lattice of substantial dimension is a difficult problem. The problem is not known to be but most people be...
متن کاملCandidate Multilinear Maps from Ideal Lattices and Applications
We describe plausible lattice-based constructions with properties that approximate the soughtafter multilinear maps in hard-discrete-logarithm groups, and show that some applications of such multi-linear maps can be realized using our approximations. The security of our constructions relies on seemingly hard problems in ideal lattices, which can be viewed as extensions of the assumed hardness o...
متن کاملTitle: Estimated Breaking times for Ntru Lattices
In this note we report on experiments with the lattices underlying the NTRU Public Key Cryptosystem. We present data for the time needed to nd a small vector and use this data to extrapolate expected breaking times for the NTRU PKCS for various parameter values. In particular, we nd that NTRU 167, NTRU 263, and NTRU 503 are at least as secure as RSA 512, RSA 1024, and RSA 2048 respectively. In ...
متن کامل